Some New Equiprojective Polyhedra

نویسندگان

  • Masud Hasan
  • Mohammad Monoar Hossain
  • Alejandro López-Ortiz
  • Sabrina Nusrat
  • Saad Altaful Quader
  • Nabila Rahman
چکیده

A convex polyhedron P is k-equiprojective if all of its orthogonal projections, i.e., shadows, except those parallel to the faces of P are k-gon for some fixed value of k. Since 1968 it is an open problem to construct all equiprojective polyhedra. Recently, Hasan and Lubiw [8] have given a characterization of equiprojective polyhedra. Based on their characterization, in this paper we discover some new equiprojective polyhedra by cutting and gluing existing polyhedra.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Equiprojective Polyhedra

A convex polyhedron P is equiprojective if, for some k, the orthogonal projection (or “shadow”) of P in every direction, except those directions parallel to faces of P , is a k-gon. We address an open question posed by Shepherd [11], and reported in [5], by characterizing equiprojective polyhedra, and giving an O(n log n) time recognition algorithm.

متن کامل

"new" Uniform Polyhedra

Definitions of polygons and polyhedra, more general than the one traditionally accepted, allow the construction of "new" uniform polyhedra. Although regular polyhedra, as well as some other classes of polyhedra, have recently been discussed from this point of view, the uniform polyhedra seem not to have been considered till now.

متن کامل

An Algorithmic Theory of Lattice Points in Polyhedra

We discuss topics related to lattice points in rational polyhedra, including efficient enumeration of lattice points, “short” generating functions for lattice points in rational polyhedra, relations to classical and higher-dimensional Dedekind sums, complexity of the Presburger arithmetic, efficient computations with rational functions, and others. Although the main slant is algorithmic, struct...

متن کامل

ay 2 00 8 Notes on Convex Sets , Polytopes , Polyhedra Combinatorial Topology , Voronoi Diagrams and Delaunay Triangulations

Some basic mathematical tools such as convex sets, polytopes and combinatorial topology, are used quite heavily in applied fields such as geometric modeling, meshing, computer vision, medical imaging and robotics. This report may be viewed as a tutorial and a set of notes on convex sets, polytopes, polyhedra, combinatorial topology, Voronoi Diagrams and Delaunay Triangulations. It is intended f...

متن کامل

Aspects of Convex Geometry Polyhedra, Shellings, Voronoi Diagrams, Delaunay Triangulations

Some basic mathematical tools such as convex sets, polytopes and combinatorial topology, are used quite heavily in applied fields such as geometric modeling, meshing, computer vision, medical imaging and robotics. This report may be viewed as a tutorial and a set of notes on convex sets, polytopes, polyhedra, combinatorial topology, Voronoi Diagrams and Delaunay Triangulations. It is intended f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1009.2252  شماره 

صفحات  -

تاریخ انتشار 2010